Ring graphs and complete intersection toric ideals
نویسندگان
چکیده
منابع مشابه
Ring graphs and complete intersection toric ideals
We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideal...
متن کاملToric complete intersection codes
In this paper we construct evaluation codes on zero-dimensional complete intersections in toric varieties and give lower bounds for their minimum distance. This generalizes the results of Gold–Little–Schenck and Ballico–Fontanari who considered evaluation codes on complete intersections in the projective space.
متن کاملComplete Intersections in Toric Ideals
We present examples which show that in dimension higher than one or codimension higher than two, there exist toric ideals IA such that no binomial ideal contained in IA and of the same dimension is a complete intersection. This result has important implications in sparse elimination theory and in the study of the Horn system of partial differential equations.
متن کاملMatroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators
In this paper, we investigate three problems concerning the toric ideal associated to a matroid. Firstly, we list all matroids M such that its corresponding toric ideal IM is a complete intersection. Secondly, we handle the problem of detecting minors of a matroidM from a minimal set of binomial generators of IM. In particular, given a minimal set of binomial generators of IM we provide a neces...
متن کاملOn dual toric complete intersection codes
In this paper we study duality for evaluation codes on intersections of d hypersurfaces with given d -dimensional Newton polytopes, so called toric complete intersection codes. In particular, we give a condition for such a code to be quasi-self-dual. In the case of d = 2 it reduces to a combinatorial condition on the Newton polygons. This allows us to give an explicit construction of dual and q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.03.020